The complexity of uniform Nash equilibria and related regular subgraph problems
نویسندگان
چکیده
We investigate the complexity of finding Nash equilibria in which the strategy of each player is uniform on its support set. We show that, even for a restricted class of win–lose bimatrix games, deciding the existence of such uniform equilibria is an NP-complete problem. Our proof is graph-theoretical. Motivated by this result, we also give NPcompleteness results for the problems of finding regular induced subgraphs of large size or regularity, which can be of independent interest. © 2008 Elsevier B.V. All rights reserved.
منابع مشابه
Computing Nash Equilibria Gets Harder: New Results Show Hardness Even for Parameterized Complexity
In this paper we show that some decision problems regarding the computation of Nash equilibria are to be considered particularly hard. Most decision problems regarding Nash equilibria have been shown to be NP-complete. While some NP-complete problems can find an alternative to tractability with the tools of Parameterized Complexity Theory, it is also the case that some classes of problems do no...
متن کاملNew Results on the Complexity of Uniformly Mixed Nash Equilibria
We are interested in the complexity of finding Nash equilibria with one uniformly mixed strategy (that is, equilibria in which at least one played strategy is a uniform probability function). We show that, even in imitation bimatrix games, where one player has a positive payoff if he plays the same pure strategy as the opponent, deciding the existence of such an equilibrium is an NP-complete pr...
متن کاملConstrained Pure Nash Equilibria in Graphical Games
The rational behavior of non-cooperative players is often formalized by means of the game theoretic notion of Nash equilibrium. However, there are several practical applications (e.g., multiagent planning, mechanism design, and routing protocols design), where the computation of any Nash equilibrium could not be satisfactory, since we are often interested only in equilibria that satisfy some ad...
متن کاملThe Complexity of Games on Highly Regular Graphs
We present algorithms and complexity results for the problem of finding equilibria (mixed Nash equilibria, pure Nash equilibria and correlated equilibria) in games with extremely succinct description that are defined on highly regular graphs such as the d-dimensional grid; we argue that such games are of interest in the modelling of large systems of interacting agents. We show that mixed Nash e...
متن کاملDecision Problems for Nash Equilibria in Stochastic Games
We analyse the computational complexity of finding Nash equilibria in stochastic multiplayer games with ω-regular objectives. While the existence of an equilibrium whose payoff falls into a certain interval may be undecidable, we single out several decidable restrictions of the problem. First, restricting the search space to stationary, or pure stationary, equilibria results in problems that ar...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Theor. Comput. Sci.
دوره 401 شماره
صفحات -
تاریخ انتشار 2008